Quantifier Acquisition: Presuppositions of “every”
نویسنده
چکیده
Three components of determiner meanings – truth conditions, implicatures, and presuppositions – have been identified. One of the major findings in acquisition, related to the truth conditions of the quantifiers, has been that children go through at least two stages of non-adult interpretation of the quantifier every (Philip, 1995). More recently, researchers (Noveck, 2001; Gualmini et al., 2001; Chierchia, 2001b; Papafragou & Musolino, 2003) have shown that children understand quantifiers logically in a context where adults derive scalar implicatures (for example, some vs. all). In this paper, I focus on the third component of the determiner meaning, presupposition. Using Felicity Judgment Task, I argue that children acquire the lexical presupposition earlier than the implicated presupposition, and that the acquisition path of implicated presupposition resembles more closely that of scalar implicatures.
منابع مشابه
Presuppositions of quantified sentences : Experimental Data ∗
Some theories (e.g., Beaver, 1994, 2001) assume that sentences with presupposition triggers in the scope of a quantifier carry an existential presupposition, as in (2), others (e.g., Heim, 1983 or Schlenker, 2008a,b) assume that they carry a universal presupposition, as in (3). (1) No student knows that he is lucky. (2) Existential presupposition: At least one student is lucky. (3) Universal pr...
متن کاملPresuppositions and Quantifier Domains
In this paper, I will argue for a new account of presuppositions which is based on double indexing as well as minimal representational contexts providing antecedent material for anaphoric presuppositions, rather than notions of context defined in terms of the interlocutors' pragmatic presuppositions or the information accumulated from the preceding discourse. This account applies in particular ...
متن کاملOn residuated lattices with universal quantifiers
We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...
متن کاملComputing adverbial quantifier domains
This paper describes a method for computing the domain of quantification of an adverbially quantified sentence. This method relies on the accommodation of presuppositions in the scope of a quantificational adverb and on the resolution of the domain in context. This paper also describes a computational system for processing such sentences based on this method.
متن کامل